Approximately optimal facet value selection
نویسندگان
چکیده
منابع مشابه
Approximately Optimal Teaching of Approximately Optimal Learners
We propose a method of generating teaching policies for use in intelligent tutoring systems (ITS) for concept learning tasks [37], e.g., teaching students the meanings of words by showing images that exemplify their meanings à la Rosetta Stone [30] and Duo Lingo [13]. The approach is grounded in control theory and capitalizes on recent work by [28], [29] that frames the “teaching” problem as th...
متن کاملApproximately Optimal Auctions
We show that auctions can generate near optimal total expected revenue by not using optimal reserve prices. Suppose we have n = 1 bidders in a posted-price, sealed-bid auction. This bidder has type v i drawn from distribution F. We can describe what the expected revenue is with a functionˆR : T → R: ˆ R(p) = p(1 − F(p)). (1) Figures 1 and 2 show expected revenue functions for the exponential di...
متن کاملTowards Approximately Optimal Poker
(www.aaai.org). All rights reserved. Creating strategies for different games forces us to grapple with different types of decision-making challenges. Poker is a stochastic game of imperfect information; unlike games of complete information, game-theoretic optimal strategies for poker can be randomized. Koller and Pfeffer [1] argue that two-player poker can be solved efficiently in the size of t...
متن کاملApproximately Optimal Auctions
While Myerson’s theorem provides an elegant solution to the optimal auction design problem for k-good auctions, his auction is rather complicated, and is consequently not widely used in practice. On the other hand, posted-price mechanisms are widely used in practice. We have derived an optimal posted-price mechanism for an auction with a single bidder.1 What about for multiple bidders? What is ...
متن کاملProbably Approximately Optimal Satisficing Strategies
A satisscing search problem consists of a set of probabilistic experiments to be performed in some order, seeking a satisfying connguration of successes and failures. The expected cost of the search depends both on the success probabilities of the individual experiments, and on the search strategy, which speciies the order in which the experiments are to be performed. A strategy that minimizes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2014
ISSN: 0167-6423
DOI: 10.1016/j.scico.2013.07.019